Data stream frequency reduction and/or phase shift

ABSTRACT

A frequency reduction or phase shifting circuit has an input receiving an input data stream having an input frequency and a representation of desired output frequency. A splitter splits the input data stream into a plurality of split signals each at a frequency of the desired output frequency. A plurality of catchers identify valid bits of each respective split signal. A shifter shifts valid bits identified by at least some of the catchers by a predetermined number, which establishes a de-serialization level for frequency reduction or phase shifting. An output provides an output data stream at the desired output frequency.

FIELD OF THE INVENTION

This invention relates to signal conversion, and particularly toconversion of signals for frequency reduction and/or phase shifting.

BACKGROUND OF THE INVENTION

Digital circuits operate on bit signals having high and low states,often represented by “1”s and “0”s. The bit rate is referred to as thebit frequency, or data frequency where the bits represent data. Inintegrated circuit chips, it is common that sequential circuits operateat different frequencies (different clock rates) such that inputs of asecond circuit operating at one frequency receive outputs of a firstcircuit operating at a different frequency. Where the second circuitoperates at a higher frequency than the first circuit, it is quitesimple to convert low frequency data stream to a high frequency datastream by simply inserting additional 0's into the low frequency stream.However, a reversal of that conversion (i.e., to convert a highfrequency data stream to a low frequency data stream) is not so easy.

Consider a circuit that operates at a given clock rate set by a clocksignal, CLOCK, has data bus carrying data bits, DATA, and a portcarrying valid bits, VALID, identifying whether a corresponding data biton the data bus represents real data. The number of bits in VALID equalsthe number of clock cycles. The VALID bit is true, or “1”, when theassociated DATA bit on the data bus represents real data, and false, or“0”, when the DATA bit is not real data. The density of a data streamcontaining DATA is the number of appearances of 1's in VALID during sometime period, T, divided by the number of clock cycles for that period.Thus the density is a number having a maximum value of 1.0 representinga maximal density when VALID=1 on each clock cycle. Where the timeperiod T is fixed, the density may be expressed simply as the number,DENS, of appearances of 1's in the VALID signal during period T.Dividing DENS by the number of clock cycles during period T results inthe actual density. For example, if there are 256 clock cycles in timeperiod T and 205 of the VALID bits are 1's, the density may be expressedas DENS=205, which is a density of 205/256=0.8008.

Considering the case of converting a high frequency data stream to a lowfrequency data stream, if the density of the high frequency data streamis low enough, the conversion might be accomplished by data compression,namely eliminating DATA bits from the high frequency data stream havingassociated VALID=0 bits. For example, if a high frequency data streamcontains 10 DATA bits, 0110010011, over a given period T, and theassociated VALID bit stream is 1110111011, DENS=8, and the density ofthe bit stream is 0.8. At high frequency f_(HIGH), T=10/f_(HIGH). Thishigh frequency data stream might be converted to a low frequency datastream by compressing the data to remove invalid data bits, forming thelow frequency data stream containing as few as 8 data bits, 01101011having an associated VALID bit stream, 11111111. However, this type ofconversion is possible only if the density of the resulting lowfrequency data stream does not exceed 1.0, i.e., DENS≦8, meaning thatf_(LOW) must be at least as great as 0.8f_(HIGH) (f_(LOW)≧0.8f_(HIGH)).If f_(LOW)<0.8f_(HIGH) in the example, frequency conversion by datacompression cannot be accomplished. Instead, it is common to employ ade-serialization technique to split the high frequency data stream intoa plurality of low frequency data streams which are then applied to theoutput circuit.

Even if two signals have the same frequency, they may phase-shifted fromeach other, particularly if they employ different clock generators. Insuch a case, there is a need to synchronize data streams.

The present invention is directed to converter circuit that can converta high frequency data stream to a low frequency data stream and cancorrect for phase shift between data streams.

SUMMARY OF THE INVENTION

In accordance with an embodiment of the present invention, a frequencyreduction or phase shifting circuit has an input receiving an input datastream having an input frequency and a representation of desired outputfrequency. A splitter splits the input data stream into a plurality ofsplit signals each at a frequency of the desired output frequency. Aplurality of catchers identify valid bits of each respective splitsignal. A shifter shifts valid bits identified by at least some of thecatchers by a predetermined number. An output provide an output datastream at the desired output frequency.

One selected predetermined number operates the circuit as a phaseshifter; other predetermined numbers identify a de-serialization levelfor frequency reduction.

In some embodiments, the splitter also receives a stream of validitybits identifying which bits of the data stream are valid data. Thesplitter also provides validity bits to the catchers to allow thecatchers to identify valid data to the shifter. The splitter operates ona split factor that is empirically derived based on the input and outputfrequencies and density of valid data bits in the input data stream.

In other embodiments, a process of frequency reduction and/or phaseshifting for data streams is provided. In yet other embodiments, acomputer program code is provides to cause a computer or processor toperform frequency reduction and/or phase shifting on a data stream.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a signal conversion circuit according to apresently preferred embodiment of the present invention.

FIG. 2 is a functional block diagram of a splitter used in the circuitof FIG. 1.

FIG. 3 is a functional block diagram of a catcher used in the circuit ofFIG. 1.

FIGS. 4 and 5, taken together, is a functional block diagram of aterminal device used in the circuit of FIG. 1.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Consider the case of a first stream at a high frequency, f_(HIGH),having a density so high that the first stream cannot be converted to alower frequency, f_(LOW), by data compression without exceeding anestablished maximal density of DATA bits in a data stream. A circuitaccording to the present invention de-serializes the f_(HIGH) inputstream to a k-wide stream that will operate at the second clockfrequency, f_(LOW), where k≧1. Thus the present invention provides acircuit architecture which reduces the high frequency data stream to alow frequency stream and de-serializes the input stream to a k-widestream. In the case where k=1, the circuit de-serializes an input datastream to one having a selected phase shift. Thus the present inventionalso provides circuit architecture which shifts the phase of an inputdata stream to synchronize the data stream to a output clock.

In the example where the VALID bit stream associated with the highfrequency data stream is 1110111011, the data can be considered arrangedin data packets, with each packet being identified by the number ofconsecutive 1's in the VALID bit stream. Hence in the example, the highfrequency data stream is arranged in packets of 3, 3 and 2 bits,respectively, whereas the low frequency data stream is arranged in asingle packet of 8 bits.

Consider a circuit operating at an input clock rate, inp_CLOCK, havingan input data bus receiving a bit stream, inp_DATA, and an input portreceiving inp_VALID bits. Inp_VALID is true, or “1”, when real dataappears on inp_DATA. The density of the real data, inp_DENS, is theaverage number of appearance of 1's on inp_VALID during some number ofinput clock cycles, which for example may be 256 input clock cycles(although any number of clock cycles may be employed for defininginp_DENS). The data stream may be uniform or not. The length of a datapacket (the number of consecutive 1's in inp_VALID) is denoted byburst_depth. The frequency of inp_CLOCK is denoted by inp_frq and thefrequency of out_CLOCK is denoted by out_frq.

FIG. 1 is a block diagram of circuit architecture for converting a datastream at an input clock signal frequency, inp_CLOCK, to an output clocksignal frequency, out_CLOCK. The circuit includes a splitter 10 thatreceives inp_CLOCK, as well as the inp_VALID and inp_DATA streams.Splitter 10 splits the input clock stream, inp_CLOCK, into n split_CLOCKstreams and splits the input data stream, inp_DATA, into n split_DATAstreams, for respective ones of n catchers 12. The term n is asplit_factor that is empirically derived for the specific circuit. Forexample, one a suitable calculation for split_factor for the 256 inputclock cycles might be a rounding up to the nearest integer of:

${split\_ factor} = {{3.0*\left( \frac{inp\_ frq}{out\_ frq} \right)*\left( \frac{inp\_ DENS}{256} \right)} + 1 + {{burst\_ depth}.}}$Split_factor n≧2, because burst_depth≧1.

Catchers 12 synchronize the plural split_CLOCK streams from splitter 10to the output clock frequency of out_CLOCK, which is the output clockfrequency. The n data bits from splitter 10 are supplied by respectivecatchers 12 to shifter 14 at the clock rate of out_CLOCK. The n validbits from catchers 12 are also supplied to shifter 16. Shifters 14 and16 cyclically shift indices of the respective streams based on ade-serialization factor k. The shifted streams are accumulated byk-terminal 20 to derive the output valid stream and k-wide data streams.

The logic of splitter 10 is shown in greater detail in FIG. 2. Splitter10 includes an input bus that receives the inp_DATA stream, an inputport that receives the inp_VALID stream and output registers thatprovide split_DATA[i] and split_CLOCK[i] output streams, where 0≦i<n.For ease of explanation of the logic illustrated in FIG. 2, splitter 10also includes n auxiliary registers circle[i]. The term next_circle[i]identifies the output nets for each index i. Although splitter 10 isherein described as employing physical output and auxiliary registers,the function described in association with FIG. 2 may be performed by aprocessor operating under the control of suitable program code, withoutregard to the physical attributes of the processor.

Upon receipt of the a first (i=0) inp_CLOCK bit, the n circle[i]registers are initialized to logical 0: circle[0]=0, circle[1]=0, . . ., circle[n−1]=0. Upon receipt of the a the next (i=1) inp_CLOCK bit, thenet for index 0 is set to the negation of register circle[n−1] and thenet for index 1 is set to the negation of register circle[0]:next_circle[0]=

circle[n−1]next_circle[1]=

circle[0],where

denotes a negation. In the example, next_circle[0]=1 andnext_circle[1]=1. Additionally, values of enable bits en[0] and en[1]are logically derived asen[0]=(

circle[0].Q) AND inp_VALIDen[1]=(circle[1].Q) AND inp_VALID,where .Q identifies the output of the respective register. In theexample,

-   -   en[0]=1, if inp_VALID=1,    -   en[0]=0, if inp_VALID=0,    -   en[1]=0, if inp_VALID=1,    -   en[1]=1, if inp_VALID=0.

At step 202, the value of i is set to 2, and at step 204 the value of iis compared to the value of the split_factor (n). If i is smaller thanthe split_factor, such as if n≧3, then at step 206, the net of index iis set to the output of the circle[i] register,next_circle[i]=circle[i].Q,and the value of enable bit en[i] is logically derived asen[i]=circle[i].Q AND inp_VALIDIn the example, if n≧3,

-   -   en[2]=1, if inp_VALID=0,    -   en[2]=0, if inp_VALID=1,        etc.

The value of i is then incremented at step 208 (i=i+1) and the processreturns to step 204. Thus, the loop formed by steps 204-208 generatevalues for the nets of successive indices i and successive bit valuesfor enable bits en[i] for each value of i=3, 4, . . . , (n−1), wheren≧3.

If at step 204 the value of i is not smaller than the split_factor, thenthe value of i is reset to 0 at step 210. At step 212, if the value of iis smaller than the split_factor, such as if i≠n, then at step 214 thevalue of the split_CLOCK[i] input bit to is logically derived as theEXCLUSIVE-OR of the output from the split_CLOCK[i] register and enablebit en[i].split_CLOCK[i].D=split _CLOCK[i].Q^en[i],where ^is EXCLUSIVE-OR, and .D is the register input. For example, sincesplit_CLOCK[O] register was initialized to 0, a “1” is supplied to theinput of the split_CLOCK[0] register if inp_VALID is “1”; otherwise, a“0” is supplied to the split_CLOCK[0] register.

The value of the split_DATA[i] input bit is logically derived as eitherthe negation of enable bit en[i] anded with the output from thesplit_DATA[i] register, or the enable bit en[i] anded with the inp_DATAbit.split_DATA[i].D={(

en[i]) AND split_DATA[i].Q} OR {en[i] AND inp_DATA}.In the example, the split_DATA[0] bit will take the value of theinp_DATA[0] bit if inp_VALID=1 or will take the value 0 otherwise.

Additionally, the input to the circle[i] register is logically derivedas either the negation of the inp_VALID bit anded with the output of thecircle[i] register, or the inp_VALID bit anded with the value of the netof index i.circle[i].D={(

inp_VALID) AND circle[i].Q} OR {inp_VALID AND next_circle[i]}.In the example, for i=0 the output of the circle[0] register will be 1if inp_VALID=1, or 0 otherwise.

At step 216 the value of i is incremented by 1 and the process loopsback to step 212 to consider the next value of i. If at step 212 thevalue of i is not smaller than split_factor n, such as if i=n, theprocess continues to the next inp_CLOCK cycle.

Consider the example of split-factor=n=2, and a data stream sequence ofa0, a1, a2, a3, a4, a5, . . . . Assume also that bit a2 is not validdata, so the inp_VALID stream is 1, 1, 0, 1, 1, 1, . . . . Since n=2,there are only two split_DATA stream outputs, split_DATA[0] andsplit_DATA[1], and two split clocks, split_CLOCK[0] and split_CLOCK[1].Since i=2 from step 202, i is not smaller than n at step 204, so theprocess omits the loop formed by steps 206 and 208. At step 218, thevalue of en[0] is 1 (because inp_VALID=1), and the value ofsplit_DATA[0] is the value of inp_DATA[0]=a0. The value ofsplit_CLOCK[0] is 1. At the next input clock, i is incremented at step216 (i.e., to i=1). At step 214, inp_VALID=1, so split_DATA[1]=a1 andsplit_CLOCK[1]=1. At the next input clock (i=2) with inp_VALID=0,split_DATA[0]=0 and split_CLOCK[0]=0. The process continues through theinput data stream so that split_DATA[0]=a0, 0, a4, . . . andsplit_DATA[1]=a1, a3, a5 . . . , split_CLOCK[0]=1, 0, 1, . . . andsplit_CLOCK[1]=1, 1, 1, . . . .

Where n is some greater number, such as n=3, there are n split_DATAstreams and split_CLOCK streams derived in the same manner, and thestates of the auxiliary registers and enable bits are established by theloop of steps 204, 206 and 208. Thus, where n=3 and for the examplegiven where data bit a2 is not valid, split_DATA[0]=a0, a3, . . . ,split_DATA[1]=a1, a4, . . . and split_DATA[2]=0, a5, . . . , andsplit_CLOCK[0]=1, 1, . . . , split_CLOCK[1]=1, 1, . . . andsplit_CLOCK[2]=0, 1, . . . .

FIG. 3 is a logical flow diagram of a catcher 12 that synchronizes theinput data stream at a clock rate split_CLOCK[i] to clock rateout_CLOCK. Input to each catcher 12 are out_CLOCK and the respectivesplit_DATA[i] and split_CLOCK[i]. Each catcher 12 includes a clock_valueauxiliary register and a counter, as well as a split_DATA outputregister and a catched_valid output. To synchronize the input datastream to out_CLOCK, a value corresponding the out_CLOCK clock rate isinput to the clock_value register. Upon receipt of the next out_CLOCKsignal, if the split_CLOCK rate is equal to the output of theclock_value register at step 300, the counter is set to 0 at step 302,and the split_CLOCK rate is established by the out_CLOCK rate in theclock_value register.

If at step 300 the split_CLOCK rate is not equal to the out_CLOCK rateset in the clock_value register, the count in the counter is incrementedat step 304. At step 306, if the count in the counter is equal to 1,then at step 308 split_DATA is input to the split_DATA register, and thecatched_valid bit is set to true or 1. Thus, the split_DATA registercontains valid data.

If at step 306 the count in the counter is not 1, then at step 310 thedecision is made as to whether the count in the counter is 3. If thecount is not 3 (i.e., it is 2) the process outputs catched_DATA in theform of the split_DATA in the split_DATA register in synchronous withthe value established by the clock_value register, and the nextout_CLOCK signal increments the count in the counter at step 306. Withthe count in the counter incremented to 3, at step 312 the catched_DATAregister and counter are reset to 0, the valid bit is set to 0 and thesplit_CLOCK rate is input to the clock_value register. At the nextout_CLOCK signal, the counter is incremented to 1 and the processcontinues.

Each shifter 14 and 16 simply shifts the indices based on a value ofSHIFT from terminal 18. More particularly, shifter 14 receives thecatched_DATA from each of the n catchers 12 to reassemble a data streamhaving n bits shifted_DATA[0], . . . , shifted_DATA[n−1]. The output ofshifter 14 is a shifted data stream of k valid data bits to terminal 18.Similarly, shifter 16 receives the catched_VALID bits from catchers 12in the form shifted_VALID[0], . . . , shifted_VALID[n−1], and supplies ashifted stream of k valid bits to terminal 18.

Each shifter 14, 16 cyclically (based on the shift_factor n) shiftsindices of the input array, A[i] to the output array Z[i] based on thevalue of SHIFT.Z[i]=A[i+SHIFT % split_factor],where 0≦i<split_factor. The number of multiplexers in each shifter 14,16 isdepth*split_factor*width,where depth is number of digits for SHIFT and width is the width of thebus.

FIGS. 4 and 5, taken together, are a logical flow diagram of terminal18. Terminal 18 accumulates k valid bits and then recalculates a newSHIFT (value k) for shifters 14 and 16. Terminal 18 has k outputs, whichare outputs of k consistent catchers 12. Thus for shift=0, terminal 18provides outputs of first k catchers, for shift=k the circuit's outputsare outputs of next k catchers and so on. Hence, the output is a k-widedata stream at out_CLOCK frequency

Terminal circuit 18 assigns the first k outputs of the n data outputsfrom data shifter 14, and adds value k to the shift. Thus for shift=0the circuit's outputs are outputs of first k catchers 12, for shift=kthe terminal circuit outputs are outputs of next k catchers and so on.Terminal 18 has k inputs tvalid[0], . . . , tvalid[k−1] (first k outputsof valid shifter 16), k input data buses tdata[0], . . . , tdata[k−1](first k outputs of data shifter 14), valid_count register, k dataoutput registers and a SHIFT output register. Terminal 18 also has kauxiliary registers data_buf and a cur_valid register.

At step 400, the contents of the valid_count register and cur_validregister are initialized to 0, i is set to 0, and the input to the SHIFTregister is set equal to its output. If, at step 402, i<k, the DATA[i]output register is set to 0 and the input to data_buf[i] register is setto its output at step 404, and i is incremented by 1 at step 406. Theloop formed by steps 402-406 is repeated until i is not smaller than k(i.e., i=k).

Consider the case where k=2 for block 408 in FIG. 4. If at step 410 thevalid_count register is 1, then the cur_valid register is set totvalid[0] at step 412 and the process continues to step 418. If at step410 the valid_count register is not contain 1, then at step 414 ifvalid_count register contains 0 and if tvalid[1] is not equal to 0, thenthe cur_valid register is set to a sum of tvalid[0] and tvalid[1] atstep 416, and the process continues to step 418. If at step 414valid_count is not 0 (i.e., is 2) or if tvalid[1]! is 0, the processcontinues to step 418. Thus, for k=2, block 408 provides an output ofcur_valid=0 if either valid_count ≠0 or if tvalid[0]=0 (step 414), acur_value equal to tvalid[0] if valid_count=1 (step 412), or acur_valid=tvalid[1]+1 if valid_count=0 and tvalid[0]!=0 (where anytvalid[i] is one bit, tvalid[1]=1) (steps 414 and 416). Hence, for k=2and tvalid[i] being one bit, cur_valid may be either 0, 1 or 2.

At step 418 the value of cur_valid from block 408 is added tovalid_count and to SHIFT to derive a value_plus value and a shift_plusvalue, respectively. If at step 420 cur_value is not greater than 0(i.e., cur_value equals 0), the process continues to step 422 (FIG. 5).If at step 420 cur_value is greater than 0, then if shift_plus issmaller than split_factor at step 424, the value of SHIFT is set toshift_plus at step 426. Otherwise, if shift_plus is not greater thansplit_factor, the value of SHIFT is set to shift_plus minus shift_factorat step 428.

The result of the loops of steps 420, 424, 426 and 428 is setting of avalue of SHIFT as the value initially established at step 400 (ifcur_value=0), the value of shift_Plus (if cur_value>0 andshift_plus<split_factor) or the value of shift_plus plus split_factor(if cur_value>0 and shift_plus≧split_factor). The value of SHIFT issupplied by terminal 18 to shifters 14 and 16 (FIG. 1) as k.

Continuing the process of termination circuit 18 at FIG. 5, at step 422i is set to 0 and a loop formed of steps 430, 432, 434 and 436 isfollowed to set the output data register DATA[i] for each index i untili=k. More particularly, at step 430, if i is smaller than k, then atstep 432 if cur_valid is greater than 0 and if valid_plus equals k, thecontent of the data_buf register is input to the applicable DATA[i]register at step 434, and the value of i is incremented at step 436. Onthe other hand, if at step 432 cur_valid is not greater than 0 (i.e.,cur_valid=0) and/or if valid_plus does not equal k (valid_plus≠k), theprocess steps directly to step 436.

When i is incremented to the value of k as identified at step 430, thenat step 438, i is again set to 0 for another loop formed of steps440-458. More particularly, at step 440, if i is not smaller than k(i.e., if i≧k), then the process steps to the next out_CLOCK. If i issmaller than k, then at step 442 an index j is set to 0. If at step 444,j is smaller than or equal to i (not greater than i), a decision step446 identifies if the output of the valid_count register is equal to i−jand if cur_value>0. If the condition at step 446 is true, then if atstep 448 valid_plus is equal to k, the value of tdata[j] is input todata register DATA[i] at step 450, where tdata[j]εDATA[i], and j≦i. Onthe other hand, if the condition at step 446 is true and if at step 448valid_plus is not equal to k, then if at step 452 valid_plus>i,data_buf[i] is loaded with tdata[j] at step 454.

If the condition at step 446 is false, or upon establishing a value forDATA[i] at step 450 or a value for data_buf[i] at step 454, or ifvalid_plus is not greater than i (e.g., valid_plus≦i), index j isincremented at step 456 and the process returns to step 444 to determineif j≦i. If through the loop formed by steps 446-454 index j isincremented at step 456 so that j>i, then the process loops to incrementi at step 458 and return to step 440.

Consider the case of k=2. Steps 440-458 perform the following functions:In a first stage when valid_count.Q=0, three conditions can occur:

-   -   1. If both inputs tvalid[0] and tvalid[1] equal 1, cur_valid=2        and both inputs are coupled to the outputs (DATA[0]=tdata[0] and        DATA[1]=tdata[1]), and the process of the first stage is        repeated.    -   2. If tvalid[0]=1 and tvalid[1]=0, cur_valid=1 and tdata[0] is        stored (data_buf[0]=tdata[0]), and the process goes to the        second stage (valid_count=1).    -   3. If tvalid[0]=0, the process simply stays in the present        stage.

In a second stage when valid_count.Q=1, cur_valid=tvalid[0], and thestates of tvalid[0] and tdata[0] are considered:

-   -   1. If tvalid[0]=1, (cur_valid=1), input data tdata[0] is output        DATA[1] (DATA[1]=tdata[0]) and the process advances to the first        (or next) stage.    -   2. If tvalid[0]=0 (cur_valid=0), the process remains in the        present stage.

Hence, when in a given stage M, M real values are accumulated ondata_buf, and when k values are accumulated, they are output. In theprocess of steps 440-458, as long as j is not greater than i (in whichcase i is incremented to be greater than j) index j is either i or i−1.Consequently, for a current stage for index i, tdata[j] is eitherDATA[i] or DATA[i−1]. If tdata[j] is DATA[i−1], it had been stored asbuf_data[i] in the prior stage.

It will be appreciated, that additional stages are necessary for othervalues of k. Thus, in the description given for the second stage, iftvalid[0]=1 and DATA[1]=tdata[0], for k>2 the process advances to thenext stage, rather than to the first stage.

The present invention thus provides a circuit for converting highfrequency data streams to low frequency and for phase matching a datastream to a clock of a sequential circuit. The circuit comprises aSPLITTER circuit that splits the incoming data stream into a pluralityof n split data streams at the output phase and frequency, n CATCHERcircuits, two SHIFTER circuits, one for data and one for valid bits, andone k_TERMINAL circuit. The splitter operates on a split_factor, n,which is empirically derived for the specific circuit. Thede-serialization level, k, identifies the width of the output stream.The circuit is particularly advantageous in that it can handle phaseshifting without frequency conversion by setting k=1.

The invention also provides a process of frequency reduction and/orphase shifting of a data stream. In one embodiment, the invention iscarried out in a computer or processor operating under control of acomputer readable program containing code that is stored on a computerreadable medium, such as a recording disc, to cause the computer orprocessor to carry out frequency reduction and/or phase shift of a datastream.

Although the present invention has been described with reference topreferred embodiments, workers skilled in the art will recognize thatchanges may be made in form and detail without departing from the spiritand scope of the invention.

1. A circuit having: an input for receiving an input signal containing aplurality of bits at an input frequency and for receiving arepresentation of desired output frequency; a splitter, which splits theinput signal into a plurality of split signals each at a frequency ofthe desired output frequency; a plurality of catchers, wherein eachcatcher provides bits of a respective split signal and a valid signalidentifying bits of the respective split signal that are valid; a firstshifter, which shifts valid bits of the respective split signal that areidentified by at least some of the catchers by a predetermined number,and a second shifter, which shifts the valid signal identified by atleast some of the catchers by the predetermined number; and an outputresponsive to the shifted valid bits to provide an output signalcontaining a plurality of valid bits of the input signal at the desiredoutput frequency.
 2. The circuit of claim 1, wherein the output isfurther responsive to the shifted valid bits to derive the predeterminednumber.
 3. The circuit of claim 1 operating as a phase shifter, whereinthe predetermined number is
 1. 4. The circuit of claim 1 operating as afrequency reducer, wherein the predetermined number is greater than 1and identifies a width of the output signal.
 5. The circuit of claim 1,wherein the number of split signals and the number of catchers are basedon an empirically-derived split factor.
 6. The circuit of claim 5,wherein the split factor is based on the input frequency and the desiredoutput frequency.
 7. A computer useable medium having a computerreadable program embodied therein for addressing data to convert a highfrequency data stream to a low frequency data stream at a desired outputfrequency, the computer readable program comprising: first computerreadable program code for causing the computer to split the highfrequency data stream into a plurality of split signals each at afrequency of the desired output frequency; second computer readableprogram code for causing the computer to provide bits of a respectivesplit signal and a valid signal identifying bits of the respective splitsignal that are valid; third computer readable program code for causingthe computer to shift identified valid bits of the respective splitsignal by a predetermined number; fourth computer readable program codefor causing the computer to shift the valid signal by the predeterminednumber; and fifth computer readable program code for causing thecomputer to output an output data stream containing a plurality ofshifted valid bits of the input signal at the desired output frequency.8. The computer useable medium of claim 7, wherein the fifth computerreadable program code is further responsive to the shifted valid bits toderive the predetermined number.
 9. The computer useable medium of claim7, wherein the number of split signals is based on anempirically-derived split factor.
 10. The computer useable medium ofclaim 9, wherein the split factor is based on the input frequency andthe desired output frequency.
 11. A process of converting a phase orfrequency of an input data stream to desired output phase or frequencycomprising: splitting the input data stream into a plurality of splitsignals each at a frequency of the desired output frequency; providing avalid signal identifying bits of the respective split signal that arevalid; shifting valid bits of the respective split signal by apredetermined number, and shifting the valid signal by the predeterminednumber; and outputting an output data stream containing a plurality ofthe shifted valid bits of the input signal at the desired outputfrequency.
 12. The process claim 11, further including deriving thepredetermined number from the shifted valid bits.
 13. The process ofclaim 11, wherein the number of split signals is based on anempirically-derived split factor.
 14. The process of claim 13, whereinthe split factor is based on the input frequency and the desired outputfrequency.
 15. The process of claim 11, further including selecting apredetermined number to selectively reduce the frequency of the inputdata stream to an output data stream having a width based on thepredetermined number or to shift a phase of the input data stream to theoutput data stream.